Optimality and Duality for Nondifferentiable Minimax Fractional Programming with Generalized Convexity
نویسندگان
چکیده
منابع مشابه
Duality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملSecond-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
*Correspondence: [email protected] Department of Mathematics, University of Tabuk, Tabuk, Kingdom of Saudi Arabia Abstract In the present paper, we are concerned with second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type assumptions. The weak, strong and converse duality theorems are proved. Results obtained in this paper ext...
متن کاملOptimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity1
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملSecond-Order Duality for Nondifferentiable Minimax Fractional Programming Involving (F, ρ)-Convexity
We focus our study to formulate two different types of second-order dual models for a nondifferentiable minimax fractional programming problem and derive duality theorems under (F, ρ)-convexity. Several results including many recent works are obtained as special cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Applied Mathematics
سال: 2011
ISSN: 2090-5564,2090-5572
DOI: 10.5402/2011/491941